Mesh Optimization Using Global Error with Application to Geometry Simplification
نویسندگان
چکیده
منابع مشابه
Mesh Optimization Using Global Error with Application to Geometry Simplification
In this paper we present a linear running time optimization algorithm for meshes with subdivision connectivity, e.g. subdivision surfaces. The algorithm optimizes a model using a metric defined by the user. Two functionals are used to build the metric: a rate functional and a distortion (i.e. error) functional. The distortion functional defines the error function to minimize, whereas the rate f...
متن کاملComputational analysis of mesh simplification using global error
Meshes with (recursive) subdivision connectivity, such as subdivision surfaces, are increasingly popular in computer graphics. They present several advantages over their Delaunay-type based counterparts, e.g., Triangulated Irregular Networks (TINs), such as efficient processing, compact storage and numerical robustness. A mesh having subdivision connectivity can be described using a tree struct...
متن کاملStellar Mesh Simplification Using Probabilistic Optimization
This paper introduces the Stellar Simplification scheme, a fast implementation of the Four–Face Cluster algorithm. In this scheme, a probabilistic optimization heuristic substitutes the priority queue of the original algorithm, which results in a 40% faster algorithm with the same order of distortion. This implementation uses a very concise data structure which consists only of two arrays of in...
متن کاملComputational analysis of 4-8 meshes with application to surface simplification using global error
We present computational results when computing approximations of a class of meshes with subdivision connectivity, known as 4-8 meshes. We consider algorithms using vertex decimation or vertex insertion. We explain that a full decomposition of a 4-8 mesh using global error can be obtained with an (n logn) decimation algorithm. Our algorithm produces progressive and adaptive representations of t...
متن کاملTopology Sensitive Volume Mesh Simplification with Planar Quadric Error Metrics
We introduce an algorithm for fast topology-sensitive decimation of volume meshes. The algorithm employs a planar quadric error metric to guarantee minimum geometric error at every simplification step, while maintaining the input mesh's geometric consistency, and restraining changes to its topological genus, at low computational costs. The proposed method presents a new alternative to existing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphical Models
سال: 2002
ISSN: 1524-0703
DOI: 10.1006/gmod.2002.0578